The Hamiltonian Alternating Path Problem
نویسندگان
چکیده
In this paper, we consider the Hamiltonian alternating path problem for graphs, multigraphs, and digraphs. We describe an approach to solve the problem. This approach is based on constructing logical models for the problem. We use logical models for the Hamiltonian alternating path problem to solve the Hamiltonian path problem and the planning a typical working day for indoor service robots problem. Also, we use these models for Bennett’s model of cytogenetics, automatic generation of recognition modules, and algebraic data.
منابع مشابه
Finding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملFault-free Hamiltonian Cycles in Alternating Group Graphs with Conditional Edge Faults
The alternating group graph, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed computing. In this paper, adopting the conditional fault model in which each vertex is assumed to be incident with two or more fault-free edges, we show that an n-dimensional alternating group graph can tolerate up to 4n − 13 edge faults, w...
متن کاملLong Alternating Cycles in Edge-Colored Complete Graphs
Let K n denote a complete graph on n vertices whose edges are colored in an arbitrary way. And let ∆(K n) denote the maximum number of edges of the same color incident with a vertex of K n. A properly colored cycle (path) in K n, that is, a cycle (path) in which adjacent edges have distinct colors is called an alternating cycle (path). Our note is inspired by the following conjecture by B. boll...
متن کاملComputing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric
We design a linear time algorithm computing the maximum weight Hamiltonian path in a weighted complete graph KT , where T is a given undirected tree. The vertices of KT are nodes of T and weight(i, j) is the distance between i, j in T . The input is the tree T and two nodes u, v ∈ T , the output is the maximum weight Hamiltonian path between these nodes. The size n of the input is the size of T...
متن کاملPanconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
Jwo et al. [Networks 23 (1993) 315–326] introduced the alternating group graph as an interconnection network topology for computing systems. They showed that the proposed structure has many advantages over n-cubes and star graphs. For example, all alternating group graphs are hamiltonian-connected (i.e., every pair of vertices in the graph are connected by a hamiltonian path) and pancyclic (i.e...
متن کامل